Multi-point model reductions of VLSI interconnects using the rational arnoldi method with adaptive orders

ABSTRACT

The work proposes a model reduction method, the rational Arnoldi method with adaptive orders (RAMAO), to be applied to high-speed VLSI interconnect models. It is based on an extension of the classical multi-point Pade approximation, using the rational Arnoldi iteration approach. Given a set of predetermined expansion points, an exact expression for the error between the output moment of the original system and that of the reduced-order system, related to each expansion point, is derived first. In each iteration of the proposed RAMAO algorithm, the expansion frequency corresponding to the maximum output moment error will be chosen. Hence, the corresponding reduced-order model yields the greatest improvement in output moments among all reduced-order models of the same order.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a multi-point model reductions of VSLI interconnects, and more particularly to a multi-point model reductions of VLSI interconnects using rational arnoldi method with adaptive orders (RAMAO).

2. Description of Related Art

Interconnect plays a significant role in the recent development of high-speed VLSI design. Due to the continuous increasing in component densities and clock rates, the signal integrity problems naturally arise in the interconnect structure. For efficient simulations, it is necessary to construct a low-order macro-model whose terminal behaviors essentially capture the complicated interactions among the interconnects. The process of finding such a reduced network is referred to as model reduction [References 4, 6, 13-15 and 18].

Recently, several methods that are based on Pade synthesis have been applied to improve the model-order reduction techniques. Asymptotic waveform evaluation (AWE) [References 3 and 15], Pade via Lanczos (PVL) [Reference 6 and 7], and congruence transformations (CT) [Reference 13], have successfully to analyze interconnect systems. Among all existing methods, it has been shown that the class of Krylov-sapce methods seems to be more accurate because it can avoid the ill-conditional problems. However, these conventional approximation methods tend to converge in a local fashion around a single frequency because Pade approximation is exact at the point while accuracy is lost away from it. So the reduced-order model may grow large before becoming an acceptable global approximation. To overcome this difficulty, multi-point Pade has been proposed [References 2, 5, 12 and 18].

The straightforward way for multi-point moment matching applications is to apply the Krylov subspace algorithm at various expansion frequencies. This is the so-called rational Krylov algorithm [references 1, 9 and 16]. The present invention will further study the RAMAO to simplify the conventional algorithm without determining the order of moments at each expansion frequency in advance. The concept was first developed in the rational Lanczos method [reference 8]. In this work, the exact error between the output moment of the original system and that of the reduced-order system, associated with each expansion point, can be determined explicitly. In each iteration of the proposed method, the expansion frequency corresponding to the maximum output moment error is chosen. Consequently, the corresponding reduced-order model will yield the greatest improvement in output moments among all reduced-order models of the same order.

SUMMARY OF THE INVENTION

The main objective of the present invention is to provide an improved multi-point model reductions of VLSI interconnects using rational arnoldi method with adaptive orders To achieve the objective, the work proposes a model reduction method, the rational Arnoldi method with adaptive orders (RAMAO), to be applied to high-speed VLSI interconnect models. It is based on an extension of the classical multi-point Pade approximation, using the rational Arnoldi iteration approach. Given a set of predetermined expansion points, an exact expression for the error between the output moment of the original system and that of the reduced-order system, related to each expansion point, is derived first. In each iteration of the proposed RAMAO algorithm, the expansion frequency corresponding to the maximum output moment error will be chosen. Hence, the corresponding reduced-order model yields the greatest improvement in output moments among all reduced-order models of the same order.

Further benefits and advantages of the present invention will become apparent after a careful reading of the detailed description with appropriate reference to the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a mesh circuit;

FIG. 2 shows frequency responses of the voltage at Vout in the mesh circuit in FIG. 1;

FIG. 3 shows the RAMAO lemniscates at iterations 2, 4, 18 and 20;

FIG. 4 shows the imaginary part of Rtiz values; and

FIG. 5 shows errors in frequency responses of the current leaving from the voltage source in the mesh circuit.

DETAILED DESCRIPTION OF THE INVENTION

Circuit Equation and Moment

In analyzing an RLC circuit, the modified nodal analysis (MNA) can be applied as follows [References 13 and 18]. $\begin{matrix} {{{E\frac{\mathbb{d}{x(t)}}{\mathbb{d}t}} = {{{Ax}(t)} + {{bu}(t)}}},{{{and}\quad{y(t)}} = {c^{T}{x(t)}}},} & (1) \end{matrix}$ where state vector x(t)εR^(n) includes node voltages and branch currents of inductors; u(t)εR is the input excitation, and y(t)εR is the output. The descriptor matrix EεR^(n×n) contain capacitances and inductances; the system matrix AεR^(n×n) contain conductances and resistances; the input vector is bεR^(n), and the output incidence vector is cεR^(n). The above system is large-scale, sparse, and stable. The model order reduction problem is to find a q-order system (2), q<<n, $\begin{matrix} {{{\hat{E}\frac{\mathbb{d}{\hat{x}(t)}}{\mathbb{d}t}} = {{\hat{A}{\hat{x}(t)}} + {\hat{b}{u(t)}}}},{{\hat{y}(t)} = {{\hat{c}}^{T}{\hat{x}(t)}}},} & (2) \end{matrix}$ where Ê,ÂεC^(q×q), {circumflex over (x)},{circumflex over (b)},ĉεC^(q), and ŷεC. The reduced-order system is expected to capture the essential dynamic behaviors of the original system and to reduce the computational cost during the whole simulation process.

Suppose that u(t) is an impulse function. Taking the Laplace transform yields the transfer function of the original system as y(s)=c^(T)X(S)=c^(T)(sE−A)⁻¹b. Expanding X(s) in power series about various frequencies s_(i)εC for i=1,2 . . . ,î, we have X(s)=Σ_(j=0) ^(∞)X^((j))(s_(i))(s−s_(i))^(j), where X^((j))(s_(i))=[−(s_(i)E−A)⁻¹E]^(j)(s_(i)E−A)⁻¹b and Y^((j))(s_(i))=c^(T)X^((j))(s_(i)) . X^((j))(s_(i)) is called the jth-order system moment of X(s);Y^((j))(s_(i)) represents the jth-order output moment of Y(s) at s_(i).

Krylov Subspace

One efficient way of obtaining a reduced-order system is to use the multi-point Pade approximation (or multi-point moment matching) [Reference 2]. The multi-point Pade approximation requires that the output moment of the original system equals that of the reduced system, Y^((j))(s_(i))=Ŷ^((j))(s_(i)),j=0,1 . . . , ĵ_(i), i=1,2, . . . î. Notably, if î=1, the above equation is indeed the conventional Pade approximation. However, this method usually yields ill-conditioned problem [Reference 6]. Recent works have proposed Krylov subspace projection methods to avoid such numerical difficulties [References 4, 6, 13 and 18]. The reduced-order system is constructed by projecting an original large-dimensional problem into a low-dimensional Krylov subspace.

Given a square matrix ΨεC^(n×n) and a vector ξεC^(n), the qth Krylov sequence K_(q)(Ψ,ξ)≡(ξ,Ψξ,Ψ²ξ, . . . Ψ^(q−1)ξ) is a sequence of q column vector and the corresponding column space is called the qth Krylov space [Reference 1]. The Arnoldi algorithm can be applied to iteratively generate an orthonormal basis V_(q)εC^(n×q) from the successive Krylov subspace K_(q)(Ψ,ξ)=span{ν₁,ν₂, . . . , ν_(q)}, where ν_(i)εV_(q),i=1, . . . , q. Set Ψ=−(s_(i)E−A)⁻¹E and ξ=(s_(i)E−A)⁻¹b. The Kyrlov subspace K_(q){Ψ,ξ} is indeed spanned by the system moments X^((j))(s_(i)) for j=0,1 . . . q−1. The reduced-order Ŷ(s) can be constructed using the orthogonal projection x(t)=V_(q){circumflex over (x)}(t). In such a situation, the reduced system parameters in Eq. (2) can be defined by the congruence transformation [Reference 13 and 18], Ê=V_(q) ^(T)EV_(q), Â=V_(q) ^(T)AV_(q), {circumflex over (b)}=V_(q) ^(T)b, and ĉ=V_(q) ^(T)c   (3) The number of moments in the reduced system is exactly the number of moments in the original system at an expansion frequency s_(i), up to the order of q, that is, Y^((j))(s_(i))=Ŷ(s_(i)), for j=0,1 . . . ,q−1. Adjoint Network Reduction

Suppose that c=b. Let the signature matrix S be defined as S=[I_(nv)0;0−I_(ni)] so that S⁻¹=S,SES=E,SAS=A^(T), and Sb=b[11,18]. Suppose that X^((j))(s_(i))εcolspan{V_(q)} for j=0,1 . . . ,ĵ−1 and i=1,2 . . . î. V_(q) is the orthonormal matrix generated iteratively by the AORA algorithm. Let U=[V SV_(q)] be the congruence transformation matrix for model-order reductions, then Ŷ ^((j))(s _(i))=Y ^((j))(s _(i)), for j=0,1 . . . 2ĵ−1 and i=1,2 . . . ,î  (4)

Therefore, the cost about constructing the congruence transformation matrix can be simplified up to 50% of the previous methods.

A rational Arnoldi method, which uses multiple expansion points, was developed to implement the multi-point Pade approximation. To simplify the developments, the number of the matched moments of the reduced-order system at each expansion point are assumed to be fixed. Formally, let S=(s₁, s₂, . . . s_(i)} represent the set of predetermined expansion frequencies. Let j=(ĵ₁, ĵ₂, . . . ĵ_(i)} be the set of the number of the matched moments at each corresponding frequency. The rational Arnoldi method will generate a reduced-order system transfer function Ŷ(s), which matches q-order (q=Σ_(i=1) ^(î)ĵ₁) moments of the original system transfer function, Y(s), at the expansion points s_(i),i=1, . . . î.

Implementing the rational Arnoldi method is equivalent to implementing the Arnoldi method ĵ, times at î expansion frequencies. That is, the first ĵ₁ iterations correspond to the expansion frequency s₁; the next ĵ₂ iterations are associated with s₂, and so on. Each Arnoldi iteration generates ĵ_(i) orthonormal vectors. Then, V_(q)=[v₁,v₂, . . . v_(q)] is the desired orthonormal matrix generated from a union Krylov space at various expansion points, as stated by $K_{q} = {\left\lbrack {{X^{(0)}\left( s_{1} \right)},\ldots\quad,{X^{({{\hat{j}}_{1} - 1})}\left( s_{1} \right)},\ldots\quad,{X^{(0)}\left( s_{\hat{i}} \right)},\ldots\quad,{X^{({{\hat{j}}_{\hat{1}} - 1})}\left( s_{\hat{i}} \right)}} \right\rbrack.}$

Table 1 refers to the algorithm of the rational Arnoldi method. TABLE 1 Rational Arnoldi Algorithm Algorithm 1: RA (input: E, A, b, S, J; output: V_(q)) (1): /* Initialize */ r₀ := (s₁E − A)⁻¹b (2): /* Begin RA Iterations */ for i = 1, 2, ..., î do for j = 1, 2, ..., ĵ_(i) do k := (i − 1)ĵ_(i) + j (2.1): /* Generate the New v_(k) */ h_(k,k−1) := ∥r_(k−1)∥, v_(k) = r_(k−1)/h_(k,k−1) (2.2): /* Update r_(k) for the Next Iteration */ if j = ĵ_(i) and i <= î then r_(k) := (s_(i+1)E − A)⁻¹b else r_(k) := −(s_(i)E − A)⁻¹Ev_(k) end if for t = 1, 2, ..., k do h_(t,k) := v_(t) ^(H)r_(k), r_(k) := r_(k) − h_(t,k)v_(t) end for end for end for q := Σ_(i=1) ^(î)ĵ_(i), H_(q) := [h_(i,j)]_(i,j)=_(1,2,... ,q) V_(q) = [v₁ v₂ ... v_(q)] (3): /* Yield Real V_(q) for Complex Expansion Points */ if there exists any s_(i) ε S such that s_(i) is not real then V_(r) := real(V_(q)), V_(i) := imag(V_(q)) [V_(q), rr] = qr([V_(r) V_(i)]) end if

Special attention should be paid to any change of the expansion point. Step (Krylov Subspace) gives relevant details. If the expansion points remains unchanged, j=ĵ_(i) and i≦î, then the residue vector r_(k) is the same as that used in the Arnoldi method. Else, if the expansion point is changed, then the residue vector r_(k) can be reset to (s_(i+1)E−A)⁻¹b, which is equal to the system moment X⁽⁰⁾(s₁₊₁) for the subsequent expansion frequency s_(i+1). Hence, this expression intuitively captures the concept of moments. Moreover, the errors between the output moments of the original model and those of the reduced-order model can be exactly and efficiently calculated from the residue vectors, stated in Theorem 2 in detail. Accordingly, the specific choice of the residue vector in Step (2.2) plays a crucial role in developing the proposed RAMAO method. Given the settings specified in Step (2.2), the new orthonormal vector v_(k) and the orthonormal matrix V_(k−1) generated in earlier iterations can indeed span the entire Krylov subspace. Once the orthonormal matrix V_(q) has been formed by applying the rational Arnoldi method, the reduced-order system can be obtained using the congruence transformation. The following Theorem 1 indicates that the output moments can be matched.

THEOREM 1. [Reference 10] Let's V_(q) be the orthonormal matrix generated by the rational Arnoldi algorithm with q iterations. Since X^((j))(s_(i))εcolspan{V_(q)} for j=0,1, . . . ,ĵ_(i) and i=1,2, . . . î, we have X ^((j))(s _(i))=V _(q) {circumflex over (X)}(s _(i)) and Y ^((j))(s _(i))=Ŷ ^((j))(s _(i))   (5) The Ramao Method

As stated in the last section, selecting a set of expansion points s_(i) for i=1, . . . , î and the number of matched moments ĵ_(i) about each s_(i) is by no means trivial. For simplicity, the expansion points s_(i) for i=1, . . . , î are determined in advance using engineering heuristics or experimental measurements over a specified frequency range. This section describes an intelligent scheme for choosing multiple expansion points in each iteration.

Suppose that Y^((j))(s_(i))=Ŷ^((j))(s_(i)) for j=1,2, . . . ,ĵ_(i) and i=1,2, . . . ,î after q iterations of the rational Arnoldi algorithm. However, that the (j+1)st-order output moments Y^((j+1))(s_(i))=Ŷ^((j+1))(s_(i)) can be guaranteed. The concept that underlines the RAMAO method is employed to select an expansion point s_(i*) _(q+1) in the (q+1) st iteration. Hence, the resulting (q+1)st-order reduced model yields the greatest moment improvement |Y^((j+1))(s_(i*) _(q+1) )−Ŷ^((j+1))(s_(i*) _(q+1) )| of the qth-order reduced-order model. The moment errors can be directly obtained in the new iteration without explicitly calculating system moments. Table 2 shows the algorithm of the RAMAO method. The vector S includes î expansion points; q is the total number of iterations, and V_(q) is the resulting orthonormal matrix. The main difference between the rational Arnoldi method and the RAMAO method is in Step (2.1). Algorithm 2: RAMAO (input: E, A, b, c, S, q; output: V_(q)) (1): /* Initialize */ for each s_(i) ε S do k⁽⁰⁾(s_(i)) := (s_(i)E − A)⁻¹b, r⁽⁰⁾(s_(i)) := k⁽⁰⁾(s_(i)) h_(π)(s_(i)) := 1 end for (2): /* Begin RAMAO Iterations */ for j = 1, 2, . . . , q do (2.1): /* Select the Expansion Frequency with the Maximum Output Moment Error*/ Choose s_(i) ε S as the i giving max_(i)(|h_(π)(s_(i))c^(T)r^((j−1))(s_(i))|) Set s_(i) _(j) * be the expansion frequency in the jth iteration (2.2): /* Generate the Orthonormal Vector at s_(ij)* */ h_(j,j−1)(s_(i) _(j) *) := ∥r^((j−1))(s_(i) _(j) *)∥ v_(j) = r^((j−1))(s_(i) _(j) *)/h_(j,j−1)(s_(i) _(j) *) h_(π)(s_(i) _(j) *) := h_(π)(s_(i) _(j) *) · h_(j,j−1)(s_(i) _(j) *) (2.3): /* Update r^((j))(s_(i)) for the Next Iteration */ for each s_(i) ε S do if (s_(i) == s_(i) _(j) *) then k^((j))(s_(i) _(j) *) := −(s_(i)E − A)⁻¹Ev_(j) else k^((j))(s_(i)) := k^((j−1))(s_(i)) end if r^((j))(s_(i)) := k^((j))(s_(i)) for t = 1, 2, . . . , j do h_(t,j)(s_(i)) := v_(t) ^(H)r^((j))(s_(i)) r^((j))(s_(i)) := r^((j))(s_(i)) − h_(t,j)(s_(i))v_(t) end for end for end for V_(q) = [v₁ v₂ . . . v_(q)] (3): /* Yield Real V_(q) for Complex Expansion Points */ if there exists any s_(i) ε S such that s_(i) is not real then V_(r) := real(V_(q)), V_(i) := imag(V_(q)) [V_(q), rr] = qr([V_(r) V_(i)]) end if The RAMAO method comprises the following steps. Step (1): Initialize the first vector k⁽⁰⁾(s_(i))=(s_(i)E−A)⁻¹b of the Krylov sequence for each expansion points s_(i), where iε{i, . . . î}. Since the reduced-order model and the orthonormal matrix are not yet determined, the residue r⁽⁰⁾(s_(i)) for each s_(i) is set to k⁽⁰⁾(s_(i)). The normalization coefficient about each s_(i), h_(π)(s_(i)), is initialized to be one.

Step (2.1): Choose an expansion frequency s_(i) such that s_(i) gives the greatest difference between the (j+1)st-order output moment of the original system Y(s) and that of the reduced-order system Ŷ(s), that is, max_(s) _(i) _(εS)|Y^((j+1))(s_(i))−Ŷ^((j+1))(s_(i))=max_(s) _(i) _(εS)|h_(π)(s_(i))c^(T)r^((j−1))(s_(i)). Ŷ^((j+1))(s_(i)) is the (j+1)st-order output moment of the reduced-order model Ŷ(s), which if yielded using the congruence transformation matrix V_(j−1)(j >1) and matches j-order output moments of Y(s) at s_(i). The chosen expansion frequency in the jth iteration is called s_(i*) _(j) .

Step (2.2): After the chosen expansion point s_(i*) _(j) in jth iteration has been determined, the single-point Arnoldi method is applied at the expansion point s_(i*) _(j) . The new orthonormal vector v_(j) is incorporated into the orthonormal matrix V_(j−1). The normalization coefficient h_(π)(s_(i))=Π_(j)∥r^((j−1))(s_(i))∥ if s_(i) is selected in the jth iteration.

Step (2.3): Determine the new residual r^((j))(s_(i)) at each expansion point s_(i). The calculation involves a projection with the new orthonormal matrix V_(j). The next vector k^((j))(s_(i*) _(j) ) at the frequency s_(i*) _(j) must be updated to enable further matching of the output moment in the (j+1)st iteration. Since no improvement is obtained at the other unselected frequency s_(i), the vector k^((j))(s_(i)) at frequency s_(i) in the current iteration remains k^((j−1))(s_(i)), which was obtained in the preceding iteration.

Step (3): Generate the real orthogonal matrix V_(q) by using the reduced QR factorization if there exists any complex expansion points.

The following theorem presents an exact formula for the output moment errors, used in Step (2.1).

THEOREM 2. [Reference 10] Suppose that the output moments of the original system and those of the reduced-order system are matched, that is, Y^((j))(s_(i))=Ŷ^((j))(s_(i)) for i=0,1, . . . ,ĵ_(i)−1 and i=1,2, . . . ,î. The system matrices of reduced-order system are generated by the congruence transformation with the othonormal matrix V_(q) using the RAMAO algorithm, where q=Σ_(i=1) ^(î)ĵ_(i). The magnitude error between the ĵ_(i)th-order moments Y^((ĵ) ^(i) ⁾(s_(i)) and Ŷ^((ĵ) ^(i) ⁾(s_(i)) at each expansion point s_(i) can be expressed as follow: |Y ^((ĵ) ^(i) ⁾(s _(i))−Ŷ ^((ĵ) ^(i) ⁾(s _(i))|=|h _(π)(s _(i))c ^(T) r ^((ĵ) ^(i) ⁻¹⁾(s _(i))|,   (6) where h_(π)(s_(i))=Π_(j)∥r^((j−1))(s_(i))∥. Moment matching can still be preserved by following the similar proof of Theorem 1.

To demonstrate that the greatest improvement in output moments I each RAMAO iteration can yield the reduced-order model with better overall performances in frequency responses, we have two observations:

1. In the first iteration in the RAMAO method, the Step (2.2) is to choose s_(i)εS such that max(|c^(T)(s_(i)E−A)⁻¹b|)=max(|Y(s_(i))|). This is equivalent to find out the expansion frequency with the maximum magnitude in the output frequency response.

2. The residual error, defined as r(s)=b−(sE−A)V{circumflex over (x)}(s), is an effective and efficient estimator for modeling error [Reference 9]. A sufficiently small r(s₀) at some s₀ typically implies a small error at s₀. ${r(s)} = {\left( {{sE} - A} \right){\left( {\sum\limits_{j = {{\hat{j}}_{i} + 1}}^{\infty}{\left( {{X^{j}\left( s_{i} \right)} - {V{{\hat{X}}^{j}\left( s_{i} \right)}}} \right)\left( {s - s_{i}} \right)^{j}}} \right).}}$ Ignoring the occurrences that s₀ is near an eigenvalue of (A,E) and assuming that the predetermined expansion points are chosen for minimizing (s−s_(i))^(j) and the high-order terms, we have r(s) ≈ X^(ĵ + 1)(s_(i)) − VX̂^(ĵ_(i) + 1)(s_(i)). Experimental Results

A mesh twelve-line circuit, presented in FIG. 1, is studied to show the efficiency of the proposed method. The line parameters of the horizontal lines are T₁:R=0.05Ω/mm,L=0.5025 nH/mm,C=0.155 pF/mm and those of the vertical lines are T₂:R=0.06Ω/mm,L=0.5480 nH/mm, C=0.1423 pF/mm. Each line is 30 mm long and divided into 20 sections. Therefore, the dimension of the system matrices is n=719, m=1, and p=1. The frequency response between 0 and 5 GHz at the voltage V_(out) is investigated and a total of 1001 frequency points distributed uniformly for simulations. Three reduced-order models are examined.

1. The Arnoldi method at an expansion frequency of 0 hz with 40 iterations;

2. The Arnoldi method at an expansion frequency of s=2πj×5 GHz with 20 iterations; and

3. The RAMAO method at the expansion frequencies of S=2πj×{1 Hz,0.83 GHz,1.67 GHz,2.50 GHz,3.33 GHz,4.17 GHz,5 GHz} with 20 iterations.

The real congruence transformation is used, so the dimensions of these reduced-order models are all equal to 40. FIG. 2 shows the corresponding waveforms. Comparing the average relative errors, corresponding to 1001 sampling frequency points, in frequency response of the three reduced-order models obtains (a) the error of the model yielded by the Arnoldi algorithm at 0 Hz: 436%; (b) that yielded by the Arnoldi algorithm at 2πj*5 GHz:60.0%, and (c) that yielded by the AORA algorithm: 14.4%. From simulation results, we have the following observations:

1. The error between the original model and the reduced-order model by the Arnoldi method at frequency 0 is very small near the low frequency. Also the error between the original model and the reduced-order model by the Arnoldi method at 3GHz near the high frequency is relatively small. The above results illustrate that the single-point Arnoldi method can only capture the local characteristics near their expansion points.

2. The reduced-order model by the RAMAO method can reflect the dynamical behaviors over a more wide frequency range than the above models. It is not hard to see that is shows the best performance among all simplified models by their intelligently selecting scheme.

FIG. 3 shows the RAMAO lemniscates at iterations 2, 4, 18 and 20, where star “*”, circle “o”, and dash “—” represent eigenvalues of the original model and the corresponding reduced-order model and lemniscates, respectively. These lemniscates help to observe the convergence behavior of approximation eigenvalues generated by the RAMAO method [Reference 17]. As the iteration number increases, components of these lemniscates typically appear, which surrounds the extreme eigenvalues of −Â⁻¹Ê and then shrink rapidly to a point, namely the eigenvalue itself. Some observations need to be addressed: (1) the convergence range is big at first and then shrunken; (2) the approximate eigenvalues almost converge to the outer eigenvalues at the 20^(th) iteration. The inner ones can not be distinguished.

Also, in orser to take a view of the convergence mechanism of the RAMAO iteration, a class of views of the convergence process appear in FIG. 4. The figure shows the Ritz values, which are the approximate eigenvalues yielded by the RAMAO algorithm for the steps from q=1 to q=20. The eigenvalues and Ritz values are represented by circle ‘o’ and point ‘.’, respectively. The lines connecting the points help to view the path of convergence. It can be observed that the dispersive eigenvalues have fast convergence and the dense ones to do. Hence, more iterations are needed to split the dense eigenvalues if better performances are desired. Note that no ghost eigenvalue exists in FIG. 4.

Next, consider the frequency response of the current that leaves from the voltage source, that is, c=b. Set the iteration number q=20. Two reduced-order models by the RAMAO method with different sets of the number of the matched moments at each expansion point are examined. First, both the orthnormal matrices V_(q) and V_(2q) are yielded by the RAMAO algorithm with 20 and 40 iteration numbers, respectively. Next, the reduced-order models generated by two projectors: (1) U₁=V_(2q). and (2) U₂=[V_(q)SV_(q)]. The total number of matched moments of the two reduced-order models is the same.

Table 3 summarizes the order of moments to be matched at each expansion points of the RAMAO algorithm. Their corresponding relative errors of frequency responses are displayed in FIG. 5. Comparing their corresponding average relative error (1) 1.22% and (2) 4.04% in FIG. 5, the error of the model yielded by applying V_(2q), which is obtained by performing the RAMAO algorithm 10 iterations more than the others, is the smallest. The result implies that the model generated by the RAMAO method with more iterations can indeed yield the greatest improvement not only in output moments but also in the frequency response among all reduced-order models with the same order. TABLE 3 Selection scheme of the RAMAO method Frequency Selecting Order (×2πj) (U = V_(q)) (U = V_(2q)) 1 Hz 2 8 2 8 16 0.83 GHz 4 10  4 10 15 1.67 GHz 7 — 7 11 19 2.50 GHz 5 — 5 12 18 3.33 GHz 6 — 6 14 — 4.17 GHz 3 9 3 9 17 5 GHz 1 — 1 13 20 Conclusions

A general framework for constructing a reduced-order system has been developed using a RAMAO method. The proposed framework extends the classical multi-point Pade approximation, using the rational Arnoldi iteration method. In each iteration, the expansion frequency will be chosen to generate the greatest improvement of output moments. The proposed method is highly suitable for large-scale electronic systems. An application of the circuit simulation bas been considered to illustrate the accuracy and the efficiency of the proposed method.

REFERENCES

[1] Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, H. van der Vorst, and editors. Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide. SLAM, Philadelphia, 2000.

[2] M. Celik, O. Ocali, M. A. Tan, and A. Atalar. Pole-zero computation in microwave circuits using multi-point Pade approximation. IEEE Trans. Circuits and Systems-I Fundamental Theory and Applications, 42:6-13, 1995.

[3] E. Chiprout and M. S. Nakhla. Asymptotic Waveform Evaluation and Moment Matching for Interconnect Analysis. Kluwer Academic Publishers, Boston, 1994.

[4] M. Chou and J. K. White. Efficient formulation and model-order reduction for transient simulation of three-dimensional VLSI interconnect. IEEE Trans. CAD, 16:1454-1476, 1997.

[5] I. M. Elfadel and D. D. Ling. A block rational Arnoldi algorithm for multipoint passive model-order reduction of mutiport RLC networks. In Proc. ICCAD 97, pages 66-71, 1997.

[6] P. Feldmann and R. W. Freund. Efficient linear circuit analysis by Pade approximation via the Lanczos process. IEEE Trans. CAD, 14:639-649, 1995.

[7] R. W. Freund. Krylov-subspace methods for reduced-order modeling in circuit simulation. Journal of Computational and Applied Mathematics, 123:395-421, 2000.

[8] K. Gallivan, E. J. Grimme, and P. V. Dooren. A rational Lanczos algorithm for model reduction. Numerical Algorithms, 12:33-63, 1996.

[9] E. J. Grimme. Krylov Projection Methods for Model Reduction. PhD thesis, University of Illinois at Urbana-Champaign, 1997.

[10] H. J. Lee, C. C. Chu, and W. S. Feng. An adaptive-order rational arnoldi method for model-order reductions of linear time-invariant systems. Technical report, Chang Gung Univ., 2003.

[11] H. J. Lee, C. C. Chu, and W. S. Feng. Interconnect modeling and sensitivity analysis using adjoint networks reduction technique. In Proc. ISCAS 2003, pages 648-651, 2003.

[12] T. V. Nguyen and J. Li. Multipoint Pade approximation using a rational block Lanczos algorithm. In Proc. ICCAD 97, pages 72-75, 1997.

[13] A. Odabasioglu, M. Celik, and L. Pileggi. PRIMA: Passive reduced-order interconnect macromodeling algorithm. IEEE Trans. On CAD, 17:645-653, 1998.

[14] J. R. Phillips, L. Daniel, and L. M. Silveira. Guaranteed passive balancing transformations for model order reduction. IEEE Trans. On CAD, 22:1027-1041, 2003.

[15] L. T. Pillage and R. A. Rohrer. Asymptotic waveform evaluation for timing analysis. IEEE Trans. On CAD, 9:352-366. 1990.

[16] A. Ruhe. Rational Krylov sequence methods for eigenvalue computation. Lin. Alg. Appl., 58:391-405, 1984.

[17] L. N. Trefethen and D. Bau. Numerical Linear Algebra. SLAM, Philadelphia, 1997.

[18] J. M. Wang, C. C. Chu, Q. Yu, and E. S. Kuh. On projection-based algorithms for model-order reduction of interconnects. IEEE Trans. Circuits Syst. I, 49:1563-1585, 2002. 

1. A tool for making simplified circuit model by adaptive-order multipoint rational Arnoldi method, which contains the following procedures: (a) Input a mesh circuit and values of its parameters; (b) Establish a state matrix of original circuit mode; (c) Input the order of required simplified circuit and acquire the corresponding orthonormal matrix by adaptive-order multipoint rational Arnoldi algorithm; (d) Orthogonally project the state space of the original circuit into the state space of the simplified circuit.
 2. A tool for making simplified circuit model by adaptive-order multipoint rational Arnoldi method as defined in claim 1, wherein the adaptive-order multipoint rational Arnoldi algorithm consists of: (a) Approximation model using moment matching method; (b) Arnoldi algorithm that features Krylov subspace iteration; (c) An approximation model that contains several expansion frequencies; (d) An intelligent automatic expansion frequency selection method.
 3. An adaptive-order multipoint rational Arnoldi method as defined in claim 2, wherein the Arnoldi algorithm that features Krylov subspace iteration could successively establish approximate simplified circuits by iteration. As the order of simplified circuit increases by one order, the newly formed simplified circuit requires only one additional iteration. Therefore, it could dramatically reduce the complexity of the operation compared with traditional non-iteration methods.
 4. An adaptive-order multipoint rational Arnoldi algorithm as defined in claim 2, wherein the approximation model that contains several expansion frequencies makes the acquired simplified circuit meet the designing regulation of frequency responding values of large range, and offsets the shortcoming of reducing the range to one expansion frequency. Accordingly it could further reduce the order of the acquired simplified circuit.
 5. An adaptive-order multipoint rational Arnoldi algorithm as defined in claim 2, wherein the intelligent automatic expansion frequency selection method can, in accordance with the given original circuit, automatically and intelligently select the optimal expansion frequency that makes the best approximation of simplified circuit in each iteration of multipoint Arnoldi algorithm. Hence it could further reduce the order of the acquired simplified circuit and make it meet the required design regulations as soon as possible.
 6. A tool making simplified circuit model by adaptive-order multipoint rational Arnoldi method as defined in claim 1, wherein the adaptive-order multipoint rational Arnoldi algorithm should follow the following procedures: (a) Input the state state matrix of the original circuit, pre-set expansion frequencies and data about the maximum iteration times of the algorithm; (b) The vector of the first Krylov series that corresponding with each initial setting frequency point; (c) Automatically and intelligently determine the optimal expansion frequency in each iteration; (d) Carry out the operation of rational Arnoldi algorithm in each iteration; (e) Output the orthonormal matrix that matches the maximum iteration times of the algorithm.
 7. An adaptive-order multipoint rational Arnoldi method as defined in claim 6, which can intelligently and automatically determine the optimal expansion frequency that, in j times iteration, makes the maximum advancing moment between the simplified circuits of j order and (j−1) order. In other words, by comparing the difference between the moment value of original circuit at different expansion frequencies and the next unmatched moment value of simplified circuit of (j−1) order, the expansion frequency with the maximum difference could be used in moment matching method.
 8. An automatic and intelligent judgment of the optimal expansion frequency as defined in claim 7, wherein the following formula of moment difference can avoid directly calculating moment value: max_(s) _(i) _(εS) |Y ^((j+1))(s _(i))−Ŷ ^((j+1))(s _(i))|=max_(s) _(i) _(εS) |h _(π)(s _(i))c ^(T) r ^((j−1))(s _(i))| Where, s_(i): in each given group of frequency points for the transfer function of expansion original circuit system {s₁,s₂, . . . , s_(imax)}, s_(i) is the number i; q: after the adaptive-order multipoint rational Arnoldi method has undergone q times iterations, the approximate simplified circuit can match the moment of q order original circuit; X(j)(s_(i)): the moment of j order original circuit expanded at frequency point s_(i), j<=q; {circumflex over (X)}^((j))(s_(i)): The j order moment of approximate simplified circuit that has matched j order original circuit moment and expanded at frequency point s_(i); r(j−1)(s_(i)): The complement vector produced by substituting the vector of Krylov series of adaptive-order multipoint rational Arnoldi method at (j−1) times iterations that corresponding expansion frequency s_(i) into modificatory Gram-Schmidt perpendicularity; hπ(s_(i)): hπ(si)=Πj∥r(j−1)(s_(i))∥, means that frequency point s_(i) is selected as the optimal expansion frequency only when the adaptive-order multipoint rational Arnoldi method iterates for j times, and is regarded as the product of the length of complement vector generated from previous iteration. Otherwise, its value remains unchanged.
 9. An adaptive-order multipoint rational Arnoldi algorithm as defined in claim 6, wherein the operation tool of multipoint Arnoldi algorithm include: (a) Carry out orthogonal projection between the vector of Krylov series corresponding with the optimal expansion frequency of this iteration and the orthogonal matrix generated by the previous iteration to produce a new orthogonal vector and fulfill the moment matching method; (b) Carry out orthogonal projection between the vector of next unmatched Krylov series corresponding with each expansion frequency of this iteration and the orthogonal matrix generated by the previous iteration. The result can be used to calculate the optimal expansion frequency of next iteration. 